Finding a New Path when Assumptions Break Down
نویسنده
چکیده
منابع مشابه
A path-aware rate policer: design and comparative evaluation
In the current Internet, congestion control is voluntary and not responding sufficiently to congestion is becoming a growing problem. Rate policers in the literature are based on the assumption of placement at a single bottleneck and a known minimum round trip time. We aim to characterise the limitations of these policers in many practical scenarios where we believe these assumptions break down...
متن کاملCross Layer Preemptive Route Repair Scheme for MANET
The challenge of mobile adhoc network (MANET) is to keep the path active for long time. Since the path breaks due to node movement and limited battery power. The route is repaired and discovered only after a path breaks in existing routing protocols. Detection of route break and establishment of a new route insisted a high cost on the network. Preemptive route repair can be an alternative. It a...
متن کاملNew Heuristic Algorithm for Flow Shop Scheduling with 3 Machines and 2 Robots Considering the Breakdown Interval of Machines and Robots Simultaneously
Scheduling is an important subject of production and operations management area. In flow-shop scheduling, the objective is to obtain a sequence of jobs which when processed in a fixed order of machines, will optimize some well defined criteria. The concept of transportation time is very important in scheduling. Transportation can be done by robots. In situations that robots are used to transpor...
متن کاملHardness Results for Two-Dimensional Curvature-Constrained Motion Planning
We revisit the problem of finding curvature-constrained paths in a polygonal domain with holes. We give a new proof that finding a shortest curvature-constrained path is NP-hard; our proof is substantially simpler, and makes fewer assumptions about the polygonal domain, than the earlier proof of [Reif and Wang, 1998]. We also prove that it is NP-hard to decide existence of a simple (i.e., non-s...
متن کاملMetrics for Security and Performance in Low-Latency Anonymity Systems
In this paper we explore the tradeoffs between security and performance in anonymity networks such as Tor. Using probability of path compromise as a measure of security, we explore the behaviour of various path selection algorithms with a Tor path simulator. We demonstrate that assumptions about the relative expense of IP addresses and cheapness of bandwidth break down if attackers are allowed ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008